Runtime verification using the temporal description logic ALC-LTL revisited
نویسندگان
چکیده
منابع مشابه
Runtime Verification Using a Temporal Description Logic Revisited
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a dynamical system. In model checking, the system’s behaviour is described by a transition system, and one needs to check whether all possible traces of this transition system satisfy the formula. In runtime verification, one observes the actual system behaviour, which at any point in time yields a...
متن کاملRuntime Verification Using a Temporal Description Logic
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a dynamical system. In model checking, the system’s behavior is described by a transition system, and one needs to check whether all possible traces of this transition system satisfy the formula. In runtime verification, one observes the actual system behavior, which at any time point yields a fini...
متن کاملDiplomarbeit -- Runtime Verification Using Temporal Description Logics
Acknowledgements First of all, I would like to thank my supervisor—Professor Franz Baader. Without his guidance and useful pointers this thesis would not have been possible. I am thankful for his patience and his helpful answers to my questions as well as his remarks. I would like to thank also the teachers at Technische Univerität Dresden for their motivating lectures on theoretical computer s...
متن کاملTemporal Runtime Verification using Monadic Difference Logic
In this paper we present an algorithm for performing runtime verification of a bounded temporal logic over timed runs. The algorithm consists of three elements. First, the bounded temporal formula to be verified is translated into a monadic first-order logic over difference inequalities, which we call monadic difference logic. Second, at each step of the timed run, the monadic difference formul...
متن کاملRuntime verification revisited
In this paper, we address a typical obstacle in runtime verification of linear temporal logic (LTL) formulae: standard models of linear temporal logic are infinite traces, whereas run-time verification has to deal with only finite system behaviours. This problem is usually addressed by defining an LTL semantics for finite traces, which, however, does usually not fit well to the infinite trace s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2014
ISSN: 1570-8683
DOI: 10.1016/j.jal.2014.09.001